<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[Topics tagged with search algorithm]]></title><description><![CDATA[A list of topics that have been tagged with search algorithm]]></description><link>https://community.secnto.com//tags/search algorithm</link><generator>RSS for Node</generator><lastBuildDate>Tue, 09 Jun 2026 00:27:33 GMT</lastBuildDate><atom:link href="https://community.secnto.com//tags/search algorithm.rss" rel="self" type="application/rss+xml"/><pubDate>Invalid Date</pubDate><ttl>60</ttl><item><title><![CDATA[CS607 Assignment 1 Solution and Discussion]]></title><description><![CDATA[@zaasmi said in CS607 Assignment 1 Solution and Discussion:

Questions No. 01					 	          		          10 marks
Consider the search space below, where A is the start node and O is a goal node. Consider the tree as given below, show in table displaying how does BFS (Breadth First Search) work on given tree using simple search algorithm.

[image: jwejsAk.png]
]]></description><link>https://community.secnto.com//topic/2181/cs607-assignment-1-solution-and-discussion</link><guid isPermaLink="true">https://community.secnto.com//topic/2181/cs607-assignment-1-solution-and-discussion</guid><dc:creator><![CDATA[zaasmi]]></dc:creator><pubDate>Invalid Date</pubDate></item></channel></rss>